A BAYESIAN SEQUENTIAL BATCH-SIZE DECISION PROBLEM TO MINIMIZE EXPECTED TOTAL COMPLETION TIME ON A SINGLE MACHINE
نویسندگان
چکیده
منابع مشابه
A Bayesian Sequential Batch-size Decision Problem to Minimize Expected Total Completion Time on a Single Machine
The same kind of n jobs are processed one by one sequentially by a single machine and any number k of them may be processed as a batch. A setup time is necessary before the processing of the first job in a batch. The completion times of all the jobs in a batch are the same as the completion time of the last job in the batch and the processing time of the batch is the sum of a setup time and k t...
متن کاملAn improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
متن کاملBetter Heuristics for a Two-Stage Multi-Machine Assembly Scheduling Problem to Minimize Total Completion Time
We address the two-stage multi-machine assembly scheduling problem to minimize total completion times of all jobs. The first stage consists of m independently working machines where each machine produces its own component. The second stage consists of two independent and identical assembly machines. The processing of a job at the second stage cannot start until its m components, produced by t...
متن کاملScheduling multiple orders per job in a single machine to minimize total completion time
This paper deals with a single-machine scheduling problem with multiple orders per job (MOJ) considerations. Both lot processing machines and item processing machines are also examined. There are two primary decisions that must be made in the proposed problem: (1) how to group the orders together, and (2) how to schedule the jobs once they are formed. In order to obtain the optimal solution to ...
متن کاملComments on "Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine"
For the single machine scheduling problem of minimizing the total completion time,Montoya Torres (J GlobOpt 27:97–103, 2003) presented a semi-online algorithm under the assumption that release dates are known in advance, and showed that it was √ 3-competitive. However, there are flaws in the proof, and the conclusion about the competitive ratio is not correct. In this note, we show that the sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2005
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.48.256